Approximate Entropy Reducts

نویسنده

  • Dominik Slezak
چکیده

We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplification (reduction of attributes) in the decision model, which approximately preserves its conditional entropy (the measure of inconsistency of defining decision by conditional attributes) should be performed to decrease its prior entropy (the measure of the model’s complexity). We show NP-hardness of optimization tasks concerning application of various modifications of AERP to data analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Order Based Genetic Algorithms for the Search of Approximate Entropy Reducts

We use entropy to extend the rough set based notion of a reduct. We show that the order based genetic algorithms, applied to the search of classical decision reducts, can be used in exactly the same way in case of extracting optimal approximate entropy reducts from data.

متن کامل

Decision-relative discernibility matrices in the sense of entropies

In rough set theory, attribute reduction is a basic issue, which aims to hold the discernibility of the attribute set. To obtain all of the reducts of an information system or a decision table, researchers have introduced many discernibility matrixes based reduction methods. However, the reducts in the sense of positive region can only be obtained by using the existing discernibility matrixes. ...

متن کامل

Application of Discernibility Tables to Calculation of Approximate Frequency Based Reducts

We provide the unified methodology for searching for approximate decision reducts based on rough membership distributions. Presented study generalizes well known relationships between rough set reducts and boolean prime implicants.

متن کامل

Approximate Reducts and Association Rules - Correspondence and Complexity Results

We consider approximate versions of fundamental notions of theories of rough sets and association rules. We analyze the complexity of searching for-reducts, understood as subsets discerning "-almost" objects from diierent decision classes, in decision tables. We present how optimal approximate association rules can be derived from data by using heuristics for searching for minimal-reducts. NP-h...

متن کامل

Towards Scalable Algorithms for Discovering Rough Set Reducts

Rough set theory allows one to find reducts from a decision table, which are minimal sets of attributes preserving the required quality of classification. In this article, we propose a number of algorithms for discovering all generalized reducts (preserving generalized decisions), all possible reducts (preserving upper approximations) and certain reducts (preserving lower approximations). The n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fundam. Inform.

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2002